Computation of cubical homology, cohomology, and (co)homological operations via chain contraction
نویسندگان
چکیده
منابع مشابه
Computation of cubical homology, cohomology, and (co)homological operations via chain contraction
We introduce algorithms for the computation of homology, cohomology, and related operations on cubical cell complexes, using the technique based on a chain contraction from the original chain complex to a reduced one that represents its homology. This work is based on previous results for simplicial complexes, and uses Serre’s diagonalization for cubical cells. An implementation in C++ of the i...
متن کاملEfficient Computation of Persistent Homology for Cubical Data
In this paper we present an efficient framework for computation of persistent homology of cubical data in arbitrary dimensions. An existing algorithm using simplicial complexes is adapted to the setting of cubical complexes. The proposed approach enables efficient application of persistent homology in domains where the data is naturally given in a cubical form. By avoiding triangulation of the ...
متن کاملRemoval and Contraction Operations in nD Generalized Maps for Efficient Homology Computation
In this paper, we show that contraction operations preserve the homology of nD generalized maps, under some conditions. This result extends the similar one given for removal operations in [6]. Removal and contraction operations are used to propose an efficient algorithm that compute homology generators of nD generalized maps. Its principle consists in simplifying a generalized map as much as po...
متن کاملComputing The Cubical Cohomology Ring
The goal of this work is to establish a new algorithm for computing the cohomology ring of cubical complexes. The cubical structure enables an explicit recurrence formula for the cup product. We derive this formula and, next, show how to extend the Mrozek and Batko [7] homology coreduction algorithm to the cohomology ring structure. The implementation of the algorithm is a work in progress. Thi...
متن کاملComplexity and cohomology of cohomological Mackey functors
Let k be a field of characteristic p > 0. Call a finite group G a poco group over k if any finitely generated cohomological Mackey functor for G over k has polynomial growth. The main result of this paper is that G is a poco group over k if and only if the Sylow p-subgroups of G are cyclic, when p > 2, or have sectional rank at most 2, when p = 2. A major step in the proof is the case where G i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Computational Mathematics
سال: 2014
ISSN: 1019-7168,1572-9044
DOI: 10.1007/s10444-014-9356-1